Privacy-preserving similarity coefficients for binary data
نویسندگان
چکیده
منابع مشابه
Privacy-preserving similarity coefficients for binary data
Similarity coefficients (also known as coefficients of association) are important measurement techniques used to quantify the extent to which objects resemble one another. Due to privacy concerns, the data owner might not want to participate in any similarity measurement if the original dataset will be revealed or could be derived from the final output. There are many different measurements use...
متن کاملNew Similarity Coefficients for Binary Data
In the last few decades, the use of similarity measures has been becoming more and more important due to the relevance of comparing samples in order to find out clusters of similar samples, to generate priority lists, and, in general, to discover patterns in data structures. In drug design, their relevance is already well established to search for the most suitable alternative to a target drug....
متن کاملk-Adic Similarity Coefficients for Binary (Presence/Absence) Data
k-Adic formulations (for groups of objects of size k) of a variety of 2adic similarity coefficients (for pairs of objects) for binary (presence/absence) data are presented. The formulations are not functions of 2-adic similarity coefficients. Instead, the main objective of the the paper is to present k-adic formulations that reflect certain basic characteristics of, and have a similar interpret...
متن کاملEfficient Privacy Preserving Protocols for Similarity Join
During the similarity join process, one or more sources may not allow sharing its data with other sources. In this case, a privacy preserving similarity join is required. We showed in our previous work [4] that using long attributes, such as paper abstracts, movie summaries, product descriptions, and user feedbacks, could improve the similarity join accuracy using supervised learning. However, ...
متن کاملSimilarity-Preserving Binary Signature for Linear Subspaces
Linear subspace is an important representation for many kinds of real-world data in computer vision and pattern recognition, e.g. faces, motion videos, speeches. In this paper, first we define pairwise angular similarity and angular distance for linear subspaces. The angular distance satisfies non-negativity, identity of indiscernibles, symmetry and triangle inequality, and thus it is a metric....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2013
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2012.02.028